منابع مشابه
Inverting Laguerre Tessellations
A Laguerre tessellation is a generalization of a Voronoi tessellation where the proximity between points is measured via a power distance rather than the Euclidean distance. Laguerre tessellations have found significant applications in materials science, providing improved modeling of (poly)crystalline microstructures and grain growth. There exist efficient algorithms to construct Laguerre tess...
متن کاملInverting Dirichlet Tessellations
Given a collection of points in the plane, one may draw a cell around each point in such a way that each point’s cell is the portion of the plane consisting of all locations closer to that point than to any of the other points. The resulting geometric figure is called a Dirichlet tessellation. An algorithm for obtaining the boundaries of the cells given the points was derived by Green and Sibso...
متن کاملOn the Laguerre Method for Numerically Inverting Laplace Transforms
The Laguerre method for numerically inverting Laplace transforms is an old established method based on the 1935 Tricomi-Widder theorem, which shows (under suitable regularity conditions) that the desired function can be represented as a weighted sum of Laguerre functions, where the weights are coefficients of a generating function constructed from the Laplace transform using a bilinear transfor...
متن کاملReplicating Tessellations
A theory of replicating tessellation of R is developed that simultaneously generalizes radix representation of integers and hexagonal addressing in computer science. The tiling aggregates tesselate Euclidean space so that the (m + 1)st aggregate is, in turn, tiled by translates of the ruth aggregate, for each m in exactly the same way. This induces a discrete hierarchical addressing systsem on ...
متن کاملInverting Implication
All generalisations within logic involve inverting implication. Yet, ever since Plotkin's work in the early 1970's methods of generalising rst-order clauses have involved inverting the clausal subsumption relationship. However , even Plotkin realised that this approach was incomplete. Since inversion of subsumption is central to many Inductive Logic Programming approaches, this form of incomple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2014
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxu029